From r-linearized polynomial equations to r-linearized polynomial equations
نویسندگان
چکیده
منابع مشابه
Linearized polynomial maps over finite fields
We consider polynomial maps described by so-called (multivariate) linearized polynomials. These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps without mixed terms over a characteristic zero field, we will only obtain (up to a linear transformation of the variables) triangular maps, which are the most b...
متن کاملFrom Discrete Boltzmann Equation to Compressible Linearized Euler Equations
This paper concerns the asymptotic analysis of the linearized Euler limit for a general discrete velocity model of the Boltzmann equation. This is done for any dimension of the physical space, for densities which remain in a suitable small neighbourhood of global Maxwellians. Providing that the initial fluctuations are smooth, the scaled solutions of discrete Boltzmann equation are shown to hav...
متن کاملPML - methods for the linearized Euler equations
A recently suggested method for absorbing boundary conditions for the Euler equations is examined. The method is of PML type and has the important property of being well posed. Results from numerical experiments using a second order discretization are presented. For some choices of parameters the method becomes unstable. The instability is observed to originate from the corner regions. A modifi...
متن کاملDifferential Constraints Compatible with Linearized Equations
Differential constraints compatible with the linearized equations of partial differential equations are examined. Recursion operators are obtained by integrating the differential constraints. One of the standard ways for determining particular solutions to partial differential equations is to reduce them to ordinary differential equations which are easier to solve. The classical work of Lie abo...
متن کاملPreconditioners for Linearized Discrete Compressible Euler Equations
We consider a Newton-Krylov approach for discretized compressible Euler equations. A good preconditioner in the Krylov subspace method is essential for obtaining an efficient solver in such an approach. In this paper we compare point-block-Gauss-Seidel, point-block-ILU and point-block-SPAI preconditioners. It turns out that the SPAI method is not satisfactory for our problem class. The point-bl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2016
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2015.08.003